Polynomial Approximation

نویسندگان

  • Gordon K. Smyth
  • Theodore Colton
چکیده

Polynomials are very simple mathematical functions which have the flexibility to represent very general nonlinear relationships. Approximation of more complicated functions by polynomials is a basic building block for many numerical techniques. This article considers two distinct but related applications. The first is polynomial regression in which polynomials are used to model a nonlinear relationship between a response variable and an explanatory variable. The advantages of using orthogonal polynomials as predictor variables are illustrated using a data set on the height and age of pre-adult girls. The second problem is that of approximating a difficult to evaluate function, such as a density or a distribution function, with the aim of fast evaluation on a computer. The use of Chebychev polynomials is illustrated for the purpose of obtaining a uniformly accurate approximation to a function over a finite interval.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A method to obtain the best uniform polynomial approximation for the family of rational function

In this article, by using Chebyshev’s polynomials and Chebyshev’s expansion, we obtain the best uniform polynomial approximation out of P2n to a class of rational functions of the form (ax2+c)-1 on any non symmetric interval [d,e]. Using the obtained approximation, we provide the best uniform polynomial approximation to a class of rational functions of the form (ax2+bx+c)-1 for both cases b2-4a...

متن کامل

The best uniform polynomial approximation of two classes of rational functions

In this paper we obtain the explicit form of the best uniform polynomial approximations out of Pn of two classes of rational functions using properties of Chebyshev polynomials. In this way we present some new theorems and lemmas. Some examples will be given to support the results.

متن کامل

Approximation of the n-th Root of a Fuzzy Number by Polynomial Form Fuzzy Numbers

In this paper we introduce the root of a fuzzy number, and we present aniterative method to nd it, numerically. We present an algorithm to generatea sequence that can be converged to n-th root of a fuzzy number.

متن کامل

A Numerical Approach for Fractional Optimal Control Problems by Using Ritz Approximation

In this article, Ritz approximation have been employed to obtain the numerical solutions of a class of the fractional optimal control problems based on the Caputo fractional derivative. Using polynomial basis functions, we obtain a system of nonlinear algebraic equations. This nonlinear system of equation is solved and the coefficients of basis polynomial are derived. The convergence of the num...

متن کامل

An approximation algorithm and FPTAS for Tardy/Lost minimization with common due dates on a single machine

This paper addresses the Tardy/Lost penalty minimization with common due dates on a single machine. According to this performance measure, if the tardiness of a job exceeds a predefined value, the job will be lost and penalized by a fixed value. Initially, we present a 2-approximation algorithm and examine its worst case ratio bound. Then, a pseudo-polynomial dynamic programming algorithm is de...

متن کامل

NON-POLYNOMIAL QUARTIC SPLINE SOLUTION OF BOUNDARY-VALUE PROBLEM

Quartic non-polynomial spline function approximation in off step points is developed, for the solution of fourth-order boundary value problems. Using consistency relation of such spline and suitable choice of parameter,we have obtained second, fourth and sixth orders methods. Convergence analysis of sixth order method has been given. The methods are illustrated by some examples, to verify the or...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002